منابع مشابه
Linear Inequalities for Enumerating Chains in Partially Ordered Sets
We characterize the linear inequalities satisfied by flag f -vectors of all finite bounded posets. We do the same for semipure posets. In particular, the closed convex cone generated by flag f -vectors of bounded posets of fixed rank is shown to be simplicial, and the closed cone generated by flag f -vectors of semipure posets of fixed rank is shown to be polyhedral. The extreme rays of both of...
متن کاملEnumerating Cyclic Orientations of a Graph
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the prob...
متن کاملEnumerating orientations of the free spikes
We show that there are exactly 2Dk inequivalent orientations of the rank-k free spike (k ≥ 4) where Dk is the k th Dedekind number. Our proof of this result is constructive and employs the monotone boolean functions.
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملKolmogorov complexity of enumerating finite sets
Solovay [5] has proved that the minimal length of a program enumerating a set A is upper bounded by 3 times the negative logarithm of the probability that a random program will enumerate A. It is unknown whether one can replace the constant 3 by a smaller constant. In this paper, we show that the constant 3 can be replaced by the constant 2 for finite sets A. We recall first two complexity meas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90012-q